Symmetry groups of boolean functions
نویسندگان
چکیده
منابع مشابه
Symmetry groups of boolean functions
We prove that every abelian permutation group, but known exceptions, is the symmetry group of a boolean function. This solves the problem posed in the book by Clote and Kranakis. In fact, our result is proved for a larger class of groups, namely, for all groups contained in direct sums of regular groups. We investigate the problem of representability of permutation groups by the symmetry groups...
متن کاملRegular symmetric groups of boolean functions
is called a Boolean function. By Aut(f) we denote the set of all symmetries of f , i.e., these permutation σ ∈ Sn for which f(xσ(1), . . . , xσ(n)) = f(x1, . . . , xn). We show the solution of a problem posed by A. Kisielewicz ([1]). We show that, with the exception of four known groups of small order, every regular permutation group is isomorphic with Aut(f) for some Boolean function f . We pr...
متن کاملRelationships between Boolean Functions and Symmetric Groups
We study the relations between boolean functions and symmetric groups. We consider elements of a symmetric group as variable transformation operators for boolean functions. Boolean function may be xed or permuted by these operators. We give some properties relating the symmetric group Sn and boolean functions on Vn.
متن کاملNon-Boolean Almost Perfect nonlinear Functions on Non-Abelian Groups
The study of nonlinear properties of Boolean functions is one of the major tasks in secret-key cryptography. But the adjective "nonlinear" has several meanings: it can be related to the resistance against the famous differential attack [2] and, in this interpretation, actually refers to (almost) perfect nonlinear functions. Moreover nonlinearity is also related to the maximum magnitude of the F...
متن کاملSymmetry in Boolean Satisfiability
This paper reviews recent approaches on how to accelerate Boolean Satisfiability (SAT) search by exploiting symmetries in the problem space. SAT search algorithms traverse an exponentially large search space looking for an assignment that satisfies a set of constraints. The presence of symmetries in the search space induces equivalence classes on the set of truth assignments. The goal is to use...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2014
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2014.01.011